A GENETIC ALGORITHM FOR SOLVING FUZZY SHORTEST PATH PROBLEMS WITH INTERVAL TYPE-2 FUZZY ARC LENGTHS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New models for shortest path problem with fuzzy arc lengths

This paper considers the shortest path problem with fuzzy arc lengths. According to different decision criteria, the concepts of expected shortest path, a-shortest path and the most shortest path in fuzzy environment are originally proposed, and three types of models are formulated. In order to solve these models, a hybrid intelligent algorithm integrating simulation and genetic algorithm is pr...

متن کامل

Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem

The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly. The fuzzy set is one of the popular tools to represent and handle uncertainty in information due to incompleteness or inexactness. In most cas...

متن کامل

A new algorithm for solving network flow problems with fuzzy arc lengths

In conventional shortest path problems, it is assumed that decision maker is certain about the parameters (distance, time etc.) between different nodes. But in real life situations, there always exist uncertainty about the parameters between different nodes. In such cases, the parameters are represented by fuzzy numbers. In this paper the shortcomings of the existing algorithm are pointed out a...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights

Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran Business Systems and Analytics Department, Distinguished Chair of Business Analytics, La Salle University, Philadelphia, PA 19141, USA Business Information Systems Department, Faculty of Business Administration and Economics, University of Paderborn, D-33098 Paderborn, Germany Young Researchers and Elite Club,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaysian Journal of Computer Science

سال: 2018

ISSN: 0127-9084

DOI: 10.22452/mjcs.vol31no4.2